generality and existence i: quantification and free logic
نویسنده
چکیده
In this paper, I motivate a cut free sequent calculus for classical logic with first order quantification, allowing for singular terms free of existential import. Along the way, I motivate a criterion for rules designed to answer Prior’s question about what distinguishes rules for logical concepts, like ‘conjunction’ from apparently similar rules for putative concepts like ‘tonk’, and I show that the rules for the quantifiers—and the existence predicate—satisfy that condition. 1 sequents and defining rules Let’s take it for granted for the moment that learning a language involves—at least in part—learning how assertions and denials expressed in that language bear on one another. The basic connection, of course, is that to assert A and to deny A clash. When we learn conjunction, we learn that there is a clash involved in asserting A, asserting B and denying A ∧ B. Similarly, when we learn disjunction, we learn that there is a clash involved in asserting A ∨ B, denying A and denying B. One way to systematically take account of the kinds of clashes involved in these acts of assertion and denial is through the language of the sequent calculus. Given collections Γ and ∆ of sentences from our language L, a sequent Γ ∆ makes the claim that there is a clash involved in asserting each element of Γ and denying each *This work has been in progress for quite some time. I am grateful for audiences at the weekly Logic Seminar and the weekly Philosophy Seminar at the University of Melbourne, as well as presentations in Aberdeen, the Australian National University, Sun Yat-Sen University, St Andrews, LMU Munich, and the Australasian Assocation for Logic Conference for helpful comments on this material. I am grateful to Aldo Antonelli, Conrad Asmus, Bogdan Dicher, Allen Hazen, Lloyd Humberstone, Catarina Dutilh Novaes, Andrew Parisi, Graham Priest, Dave Ripley, Gillian Russell, Jeremy Seligman, Shawn Standefer and Crispin Wright for discussions on these topics, and especially to Bogdan Dicher, Rohan French, Dave Ripley and Shawn Standefer for detailed comments on drafts of this paper. ¶ I dedicate this paper to Aldo Antonelli, whose untimely death leaves us all the poorer. ¶ This research is supported by the Australian Research Council, through Grant dp150103801. ¶ A current draft of this paper is available at http://consequently.org/writing/ generality-and-existence-1/.
منابع مشابه
Least Generalizations and Greatest Specializations of Sets of Clauses
The main operations in Inductive Logic Programming (ILP) are generalization and specialization, which only make sense in a generality order. In ILP, the three most important generality orders are subsumption, implication and implication relative to background knowledge. The two languages used most often are languages of clauses and languages of only Horn clauses. This gives a total of six diier...
متن کاملHantzsch reaction using [Mesi]Cl as a new, efficient and BAIL catalyst
In this work, the efficiency, generality and applicability of new Bronsted acidic ionic liquid (BAIL) 1-methyl-3-(2-(sulfooxy)ethyl)-1H-imidazol-3-ium chloride {[Msei]Cl} as heterogeneous and green catalyst for organic transformations are studied. Herein, the following one-pot multi-component reactions in the presence of [Msei]Cl are investigated: (i) the synthesis of quinoxaline derivatives fr...
متن کاملHow to Universally Close the Existential Rule
This paper introduces a nested sequent system for predicate logic. The system features a structural universal quantifier and a universally closed existential rule. One nice consequence of this is that proofs of sentences cannot contain free variables. Another nice consequence is that the assumption of a non-empty domain is isolated in a single inference rule. This rule can be removed or added a...
متن کاملIsabelle: The Next Seven Hundred Theorem Provers
Isabelle [2] is a theorem prover for a large class of logics. The object-logics are formalized within Isabelle’s meta-logic, which is intuitionistic higher-order logic with implication, universal quantifiers, and equality. The implication φ =⇒ ψ means ‘φ implies ψ’, and expresses logical entailment. The quantification ∧ x.φ means ‘φ is true for all x’, and expresses generality in rules and axio...
متن کاملOn a Decidable Generalized Quantifier Logic Corresponding to a Decidable Fragment of First-Order Logic
Van Lambalgen (1990) proposed a translation from a language containing a generalized quantifier Q into a first-order language enriched with a family of predicates Rs, for every arity i (or an infinitary predicate R) which takes Qz~(z, yl, . . . , y,~) to Vz(R(z, yl,..., g,~) --" ~b(x, Yl,..., Y,~)) (gl . . . . . g~ are precisely the free variables of Qzq~). The logic of Q (without ordinary quan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015